Weak cycle partition involving degree sum conditions
نویسندگان
چکیده
منابع مشابه
Degree sum conditions in graph pebbling
Given a graph G on n vertices and a distribution, D, of pebbles on the vertices of G, we define a pebbling move to be the removal of two pebbles from a given vertex and the placement of one on an adjacent vertex. If D has n pebbles and if after a sequence of pebbling moves we can place a pebble on any specified vertex then we call G Class 0. We give a sufficient degree sum condition for G to be...
متن کاملSpanning 2-trails from degree sum conditions
Suppose G is a simple connected n-vertex graph. Let σ3(G) denote the minimum degree sum of three independent vertices in G (which is ∞ ifG has no set of three independent vertices). A 2-trail is a trail that uses every vertex at most twice. Spanning 2-trails generalize hamilton paths and cycles. We prove three main results. First, if σ3(G) ≥ n−1, then G has a spanning 2-trail, unless G ∼= K1,3....
متن کاملDegree conditions and cycle extendability"
A non-Hamiltonian cycle C in a graph G is extendable if there is a cycle C' in G with V(C')= V(C) with one more vertex than C. For any integer k~>0, a cycle C is k-chord extendable if it is extendable to the cycle C' using at most k of the chords of the cycle C. It will be shown that if G is a graph of order n, then 6(G)>3n/4-1 implies that any proper cycle is 0-chord extendable, 6(G)>5n/9 impl...
متن کاملDegree sum conditions and vertex-disjoint cycles in a graph
We consider degree sum conditions and the existence of vertex-disjoint cycles in a graph. In this paper, we prove the following: Suppose that G is a graph of order at least 3k + 2 and σ3(G) ≥ 6k − 2, where k ≥ 2. Then G contains k vertex-disjoint cycles. The degree and order conditions are sharp.
متن کاملOn vertex-disjoint cycles and degree sum conditions
This paper considers a degree sum condition sufficient to imply the existence of k vertexdisjoint cycles in a graph G. For an integer t ≥ 1, let σt (G) be the smallest sum of degrees of t independent vertices of G. We prove that if G has order at least 7k+1 and σ4(G) ≥ 8k−3, with k ≥ 2, then G contains k vertex-disjoint cycles. We also show that the degree sum condition on σ4(G) is sharp and co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2009
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.12.081